Complexity Constraint in the Distributor’s Pallet Loading Problem

نویسندگان

چکیده

This paper presents a study on the complexity of cargo arrangements in pallet loading problem. Due to diversity perspectives that have been presented literature, is one least studied practical constraints. In this work, we aim refine and propose new set metrics measure an arrangement pallet. The parameters are validated using statistical methods, such as principal component analysis multiple linear regression, data retrieved from company logistics. Our tests show number boxes was main variable responsible for explaining

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving the pallet loading problem

This paper presents new bounds, heuristics, and an exact algorithm for the Pallet Loading Problem (PLP). PLP maximizes the number of boxes placed on a rectangular pallet. All boxes have identical rectangular dimensions and, when placed, must be located completely within the pallet. Boxes may be rotated 90 so long as they are placed with edges parallel to the pallet’s edges. The set of all PLP i...

متن کامل

A Tree Search Algorithm for the Manufacturer’s Pallet Loading Problem

Transportation and warehouse costs are the two major components of the total logistics cost. To increase the material handling efficiency both in transit and in the warehouse, pallets have been used widely in logistics systems. The manufacturer’s pallet loading problem (MPLP) is to pack identical smaller boxes onto a rectangle pallet to maximize the pallet utilization. In this research, we solv...

متن کامل

A branch-and-cut algorithm for the pallet loading problem

We propose a branch and cut algorithm for the Pallet Loading Problem. The 0-1 formulation proposed by Beasley for cutting problems is adapted to the problem, adding new constraints and new procedures for variable reduction. We then take advantage of the relationship between this problem and the maximum independent set problem to use the partial linear description of its associated polyhedron. F...

متن کامل

A tabu search algorithm for the pallet loading problem

This paper presents a new heuristic algorithm for the pallet loading problem, the problem of packing the maximum number of identical rectangular boxes onto a rectangular pallet. The problem arises in distribution and logistics and has many practical applications. We have developed a tabu search algorithm based on new types of moves. Instead of moving individual boxes, we propose moving blocks, ...

متن کامل

Analysis of upper bounds for the Pallet Loading Problem

This paper is concerned with upper bounds for the well-known Pallet Loading Problem (PLP), which is the problem of packing identical boxes into a rectangular pallet so as to maximize the number of boxes ®tted. After giving a comprehensive review of the known upper bounds in the literature, we conduct a detailed analysis to determine which bounds dominate which others. The result is a ranking of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2021

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math9151742